一种Fuzzy优化模型及其满意解

本文给出了一种目标函数和约束条件都具有模糊性的优化模型。采用求条件极值的方法,得到了求这一模型的满意解。     

解析方法与数值模拟相结合求解炸药在容器内部爆炸产生的壁面载荷

本文采用总变差递减（TVD）数值方法与强爆炸解析解相结合的手段,求解了炸药在爆炸容器内部产生的作用载荷。计算结果与实验值在几个典型位置进行了比较,二者有良好的符合。与单纯的数值方法相比,本文所探索的方法能有效地克服对称轴附近的数值振荡,不失为确定爆炸载荷的一种新途径。     

可招回秘书问题

可招回秘书问题已由Yang,Petrucceol,Choe及Bal研究过。本文将这个问题纳入Snell框架,用相对最好者的位置函数Wn代替通常的相对名次,我们得到了各种招回概率下的最优停止规则,这些结果推广了文[7]—[9]。     

舰船动力系统优化设计方法展望

简述了舰船动力系统优化设计的思想与内容,研究了舰船动力系统优化设计的理论与方法,提出了综合集成设计、智能优化设计等未来舰船动力系统优化设计的概念与方法     

吸气式高超声速飞行器助推分离过程数值仿真

针对吸气式高超声速冲压发动机验证性试验特殊的飞行环境和助推分离条件，以某轴对称吸气式高超声速飞行器级间分离问题为具体研究对象，采用非结构网格局部网格重构技术和非定常问题非定常六自由度问题仿真方法，对该复杂构型飞行器助推分离过程进行数值计算。研究得到弱干扰冷态分离状态下飞行器及助推器的运动参数和气动力参数在分离过程中的发展规律。对0.3 s内助推器的位移轨迹进行分析，判断分离方案的可行性，并给出最佳的分离工况条件。     

基于红外图像的小目标检测与跟踪方法

为了能在强杂波、低信噪比的情况下检测小目标,人们提出了许多针对小目标检测与跟踪的方法。介绍了基于红外图像的小目标检测和跟踪的各种方法和最新进展,重点讨论了灰度形态法、小波变换法、最优时空非线性滤波法用于小目标检测与跟踪的原理,并指出了今后的发展和研究方向。     

运动视觉平台点目标定位误差分析和平台最优运动轨迹设计

对运动视觉平台点目标定位问题进行了研究,介绍了基于视觉共线方程的目标定位方法,分析了共线方程关于视线约束的实质。在观测视线相关坐标系推导了视线方向角矢量对目标定位误差的影响规律,分析了多观测对定位误差的影响,并基于最小化目标定位误差推导了视觉平台的最优运动轨迹,利用简单明了的分析方法得到了与已有文献优化Fisher信息矩阵方法一致的结论。利用仿真和试验对定位误差和最优轨迹进行了验证,证实了定位误差理论分析和最优运动轨迹设计的正确性。     

布达拉宫古建筑灭火设施优化配置研究

为配合布达拉宫的消防工程改造，优化其建筑灭火设施的配置，针对现阶段布达拉宫建筑灭火设施现状，剖析了其存在的问题和缺陷，介绍了国外文物古建筑消防保护的理念，阐明了古建筑灭火设施优化配置应遵循的原则，通过对各类灭火设施保护宫殿的可行性和适用性分析，提出了布达拉宫古建筑灭火设施优化配置方案。     

Optimal timing of switches between product sales for sports and entertainment tickets

Like airlines and hotels, sports teams and entertainment venues can benefit from revenue management efforts for their ticket sales. Teams and entertainment venues usually offer bundles of tickets early in their selling horizon and put single‐event tickets on sale at a later date; these organizations must determine the best time to offer individual tickets because both types of ticket sales consume the same fixed inventory. We model the optimal a priori timing decision for a seller with a fixed number of identical tickets to switch from selling the tickets as fixed bundles to individual tickets to maximize the revenue realized before the start of the performance season. We assume that bundle and single‐ticket customers each arrive according to independent, nonhomogeneous Markovian death processes with a linear death rate that can vary over time and that the benefit from selling a ticket in a package is higher than from selling the ticket individually. We characterize the circumstances in which it is optimal for the seller to practice mixed bundling and when the seller should only sell bundles or individual tickets, and we establish comparative statics for the optimal timing decision for the special case of constant customer arrival rates. We extend our analytical results to find the optimal time for offering two groups of tickets with high and low demand. Finally, we apply the timing model to a data set obtained from the sports industry. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003